Convergence of random measures in geometric probability

نویسنده

  • Mathew D. Penrose
چکیده

Given n independent random marked d-vectors Xi with a common density, define the measure νn = ∑ i ξi, where ξi is a measure (not necessarily a point measure) determined by the (suitably rescaled) set of points near Xi. Technically, this means here that ξi stabilizes with a suitable power-law decay of the tail of the radius of stabilization. For bounded test functions f on Rd, we give a law of large numbers and central limit theorem for νn(f). The latter implies weak convergence of νn(·), suitably scaled and centred, to a Gaussian field acting on bounded test functions. The general result is illustrated with applications including the volume and surface measure of germ-grain models with unbounded grain sizes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs

This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, V ertex Separation, Edge Bisection and V ertex Bisection. For full square lattices, we give optimal layouts for the problems still...

متن کامل

Normal Approximation in Geometric Probability

Statistics arising in geometric probability can often be expressed as sums of stabilizing functionals, that is functionals which satisfy a local dependence structure. In this note we show that stabilization leads to nearly optimal rates of convergence in the CLT for statistics such as total edge length and total number of edges of graphs in computational geometry and the total number of particl...

متن کامل

Generalized Stochastic Collocation Method for Variation-Aware Capacitance Extraction of Interconnects Considering Arbitrary Random Probability

For variation-aware capacitance extraction, stochastic collocation method (SCM) based on Homogeneous Chaos expansion has the exponential convergence rate for Gaussian geometric variations, and is considered as the optimal solution using a quadratic model to model the parasitic capacitances. However, when geometric variations are measured from the real test chip, they are not necessarily Gaussia...

متن کامل

Weak Convergence of Random Sets

In this paper the classical Portmanteau theorem which provides equivalent conditions of weak convergence of sequence of probability measures is extended on the space of the sequence of probability measures induced by random sets.

متن کامل

Bertrand’s Paradox Revisited: More Lessons about that Ambiguous Word, Random

The Bertrand paradox question is: “Consider a unit-radius circle for which the length of a side of an inscribed equilateral triangle equals 3 . Determine the probability that the length of a ‘random’ chord of a unit-radius circle has length greater than 3 .” Bertrand derived three different ‘correct’ answers, the correctness depending on interpretation of the word, random. Here we employ geomet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005